A Path Computation algorithm in MPLS Traffic Engineering for reducing blocking probability

In this paper a new path computation algorithm in Traffic Engineering in MPLS networks for reducing blocking probability of requests is proposed which is an improvement of TEDB algorithm. The TE-DB is one of best path computation algorithm which is proposed in literatures. The Algorithm deploys multiple path routing and distributes the load more balanced n network. In addition, it reduces the blocking probability of requests. Reducing probability of blocking and distributing load are two important objectives in Traffic Engineering which TEDM improves these two parameters. Four heuristic algorithms are proposed for distributing load among multiple paths. The algorithms are simulated by MATLAB. The results show that TEDBM reduces the blocking probability about 50% in average and distributes the load more balanced than the TEDB algorithm. Hence, the network utilization is also increased.